Strong and weak perfect digraph theorems for perfect, \alpha-perfect and strictly perfect digraphs

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Perfect Graphs and the Perfect Graph Theorems

The theory of perfect graphs relates the concept of graph colorings to the concept of cliques. In this paper, we introduce the concept of a perfect graph as well as a number of graph classes that are always perfect. We next introduce both theWeak Perfect Graph Theorem and the Strong Perfect Graph Theorem and provide a proof of the Weak Perfect Graph Theorem. We also demonstrate an application o...

متن کامل

On generalizations of semiperfect and perfect rings

‎We call a ring $R$ right generalized semiperfect if every simple right $R$-module is an epimorphic image of a flat right $R$-module with small kernel‎, ‎that is‎, ‎every simple right $R$-module has a flat $B$-cover‎. ‎We give some properties of such rings along with examples‎. ‎We introduce flat strong covers as flat covers which are also flat $B$-covers and give characterizations of $A$-perfe...

متن کامل

Perfect Matchings and Perfect Powers

In the last decade there have been many results about special families of graphs whose number of perfect matchings is given by perfect or near perfect powers (N. Elkies et al., J. Algebraic Combin. 1 (1992), 111– 132; B.-Y. Yang, Ph.D. thesis, Department of Mathematics, MIT, Cambridge, MA, 1991; J. Propp, New Perspectives in Geometric Combinatorics, Cambridge University Press, 1999). In this pa...

متن کامل

Perfect Matchings and Perfect Squares

In 1961, P.W. Kasteleyn enumerated the domino tilings of a 2n × 2n chessboard. His answer was always a square or double a square (we call such a number "squarish"), but he did not provide a combinatorial explanation for this. In the present thesis, we prove by mostly combinatorial arguments that the number of matchings of a large class of graphs with 4-fold rotational symmetry is squarish; our ...

متن کامل

On essential, (strictly) perfect equilibria

It is known that generic games within certain collections of infinite-action normal-form games have only essential equilibria. We point to a difficulty in showing that essential equilibria in generic games are (strictly) perfect, and we identify collections of games whose generic members have only essential and (strictly) perfect equilibria. © 2014 Elsevier B.V. All rights reserved.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discussiones Mathematicae Graph Theory

سال: 2021

ISSN: 1234-3099,2083-5892

DOI: 10.7151/dmgt.2413